Graph cut - PDFSEARCH.IO - Document Search Engine

Graph cut
Results: 144

#	Item
51	Proceedings of IEEE conference on “Computer Vision and Pattern Recognition” (CVPR), 1998 p.648 Markov Random Fields with Efficient Approximations Yuri Boykov Add to Reading List Source URL: www.cs.iastate.edu Language: English - Date: 2004-09-12 22:08:02 Connectivity Dynamic programming Maximum flow problem Cut Mathematics Graph theory Applied mathematics
52	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Embroidery Problem Esther M. Arkin∗ George W. Hart† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:07:19 NP-complete problems Combinatorial optimization Graph connectivity Matching Steiner tree problem Minimum spanning tree Eulerian path Route inspection problem Cut Graph theory Theoretical computer science Mathematics
53	Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs Guy E. Blelloch Anupam Gupta Ioannis Koutis† Gary L. Miller Richard Peng Kanat Tangwongsan Carnegie Mellon University and † Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-31 22:48:01 Spanning tree Network flow Graph connectivity Maximum flow problem Randomized algorithm Minimum spanning tree Connectivity Cut SL Theoretical computer science Graph theory Mathematics
54	Confluent Hasse Diagrams David Eppstein and Joseph A. Simons University of California, Irvine Goal: • Improve Readability of Hasse Diagrams Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2011-09-15 17:39:34 Structure Dedekind–MacNeille completion Hasse diagram Confluence Planar graph Dedekind cut Partially ordered set Order theory Graph theory Mathematics
55	Shortest Cut Graph of a Surface with Prescribed Vertex Set ´ Eric Colin de Verdi`ere⋆ ´ Add to Reading List Source URL: www.di.ens.fr Language: English - Date: 2010-06-23 07:19:49 Topological graph theory Network theory Planar graphs Algebraic graph theory Matroid theory Shortest path problem Dual graph Graph embedding Matroid Graph theory Mathematics Theoretical computer science
56	Greedy Localization, Iterative Compression and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting and a Novel 2k Kernelization for Vertex Cover Frank Dehne1 , Mike Fellows2 , Frances Ro Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:09:48 NP-complete problems Parameterized complexity Kernelization Vertex cover Graph coloring Minimum k-cut Algorithm Independent set Greedy algorithm Theoretical computer science Mathematics Computational complexity theory
57	CCCG 2009, Vancouver, BC, August 17–19, 2009 Approximating Maximum Flow in Polygonal Domains using Spanners Joondong Kim ∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2009-09-02 14:32:58 NP-complete problems Delaunay triangulation Triangulation Maximum flow problem Cut Shortest path problem Graph theory Mathematics Theoretical computer science
58	PDF Document Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:11 Theoretical computer science Maximum flow problem Flow network Minimum-cost flow problem Ford–Fulkerson algorithm Edmonds–Karp algorithm Shortest path problem Matching Max-flow min-cut theorem Graph theory Mathematics Network flow
59	Thesis for the degree ‫עבודת גמר (תזה) לתואר‬ Master of Science Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2015-01-22 08:25:27 Combinatorial optimization NP-complete problems Cut Streaming algorithm Maximum cut Hypergraph Time complexity Minimum cut Matching Theoretical computer science Graph theory Mathematics
60	AN ENUMERATIVE APPROACH TO COMPUTING CUT SETS IN METABOLIC NETWORKS by Daniel Salinas Add to Reading List Source URL: www.cs.montana.edu Language: English - Date: 2014-10-27 15:50:50 Modularity Network theory Metabolite Mathematics Bioinformatics Systems biology Science Metabolism Biology Algebraic graph theory